A complexity analysis of functional interpretations 1 Mircea-Dan HERNEST a,2 and Ulrich KOHLENBACH b,3 a Laboratoire ´

Source URL: www.mathematik.tu-darmstadt.de

• Logic
• Mathematical logic
• Proof theory
• Abstraction
• Intuitionism
• Constructivism
• Logic in computer science
• Model theory
• Dialectica interpretation
• Intuitionistic logic
• Realizability
• First-order logic

Title Abstract Definitions and Examples

Source URL: spot.colorado.edu

• Knot theory
• Abstract algebra
• Order theory
• Functions and mappings
• Distributive property
• Braid group
• Braid theory
• Racks and quandles
• Model theory
• Embedding
• Algebra
• Laver table

Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of

Source URL: ndmitchell.com

• Software engineering
• Computer programming
• Declarative programming
• Functional programming
• Data types
• Programming language comparisons
• Type theory
• Higher-order functions
• Fold
• Generic programming
• Map
• Type class

Call by Contract for Cryptographic Protocols

Source URL: evenmere.org

• Formal methods
• Logic in computer science
• Metalogic
• Automated theorem proving
• Logic programming
• Substitution
• Postcondition
• First-order logic
• Parameter
• Precondition
• Well-formed formula
• Model theory

LINEAR EXTENSIONS OF PARTIAL ORDERS AND REVERSE MATHEMATICS EMANUELE FRITTAION AND ALBERTO MARCONE Abstract. We introduce the notion of τ -like partial order, where τ is one of the linear order types ω, ω ∗ , ω +

Source URL: www.math.tohoku.ac.jp

• Wellfoundedness
• Ordinal numbers
• Operator theory
• Differential forms
• Well-order
• Differential forms on a Riemann surface
• Sobolev spaces for planar domains

Extending Superposition with Integer Arithmetic, Structural Induction, and Beyond Simon Cruanes École polytechnique and Inria https://who.rocq.inria.fr/Simon.Cruanes/

Source URL: cedeela.fr

• Mathematical logic
• Theoretical computer science
• Mathematics
• Automated theorem proving
• Logic in computer science
• Model theory
• First-order logic
• Mathematical proof
• Unification
• Equality

Herbrand’s theorem and extractive proof theory U. Kohlenbach Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstrasse 7, 64289 Darmstadt, Germany September 1, 2008

Source URL: www.mathematik.tu-darmstadt.de

• Mathematics
• Mathematical analysis
• Mathematical logic
• Functions and mappings
• Computability theory
• Primitive recursive function
• Recursion
• Theory of computation
• First-order logic
• Limit of a function
• Peano axioms
• Spectral theory of ordinary differential equations

Investigations of Subsystems of Second Order Arithmetic and Set Theory in Strength between Π11 -CA and ∆12 -CA + BI: Part I Michael Rathjen Department of Pure Mathematics University of Leeds

Source URL: www1.maths.leeds.ac.uk

FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Proof theory
• Mathematical logic
• Metalogic
• Reverse mathematics
• Primitive recursive functional
• Second-order arithmetic
• Peano axioms
• Primitive recursive function
• Primitive recursive arithmetic
• Model theory
• Symbol

Universit`a degli Studi di Udine Dipartimento di Matematica e Informatica Dottorato di Ricerca in Matematica e Fisica Ciclo XXVI Ph.D. Thesis

Source URL: www.math.tohoku.ac.jp

• Order theory
• Proof theory
• Mathematical logic
• Metalogic
• Equivalence of categories
• Linear extension
• Reverse mathematics
• Theorem